On a Nordhaus-Gaddum type problem for independent domination

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nordhaus-Gaddum Type Results for Total Domination

A Nordhaus-Gaddum-type result is a (tight) lower or upper bound on the sum or product of a parameter of a graph and its complement. In this paper we study Nordhaus-Gaddum-type results for total domination. We examine the sum and product of γt(G1) and γt(G2) where G1 ⊕G2 = K(s, s), and γt is the total domination number. We show that the maximum value of the sum of the total domination numbers of...

متن کامل

Nordhaus-Gaddum bounds for independent domination

We establish sharp bounds on the sum and product of the independent domination numbers of a graph and its complement.

متن کامل

Nordhaus-Gaddum inequalities for domination in graphs

A node in a graph G = (V,E) is said to dominate itself and all nodes adjacent to it. A set S C V is a dominating set for G if each node in V is dominated by some node in S and is a double dominating set for G if each node in V is dominated by at least two nodes in S. First we give a brief survey of Nordhaus-Gaddum results for several domination-related parameters. Then we present new inequaliti...

متن کامل

Nordhaus-Gaddum bounds for locating domination

A dominating set S of graph G is called metric-locating-dominating if it is also locating, that is, if every vertex v is uniquely determined by its vector of distances to the vertices in S . If moreover, every vertex v not in S is also uniquely determined by the set of neighbors of v belonging to S , then it is said to be locating-dominating. Locating, metric-locating-dominating and locatingdom...

متن کامل

Inequalities of Nordhaus–gaddum Type for Connected Domination

A set S of vertices of a graph G is a connected dominating set if every vertex not in S is adjacent to some vertex in S and the subgraph induced by S is connected. The connected domination number γc(G) is the minimum size of a connected dominating set of G. In this paper we prove that γc(G) + γc(G) ≤ min{δ(G), δ(G)} + 4 for every n-vertex graph G such that G and G have diameter 2 and show that ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1995

ISSN: 0012-365X

DOI: 10.1016/0012-365x(94)00202-t